منابع مشابه
t-Perfection in P5-Free Graphs
A graph is called t-perfect if its stable set polytope is fully described by non-negativity, edge and odd-cycle constraints. We characterise P5-free t-perfect graphs in terms of forbidden t-minors. Moreover, we show that P5-free t-perfect graphs can always be coloured with three colours, and that they can be recognised in polynomial time.
متن کاملColoring ($P_5$, bull)-free graphs
We give a polynomial-time algorithm that computes the chromatic number of any graph that contains no path on five vertices and no bull as an induced subgraph (where the bull is the graph with five vertices a, b, c, d, e and edges ab, bc, cd, be, ce).
متن کاملThe coloring problem for $\{P_5,\bar{P_5}\}$-free graphs and $\{P_5,K_p-e\}$-free graphs is polynomial
We show that determining the chromatic number of a {P 5 , P 5 }-free graph or a {P 5 , K p − e}-free graph can be done in polynomial time.
متن کاملt-perfection in near-bipartite and in P5-free graphs
A graph is called t-perfect if its stable set polytope is fully described by non-negativity, edge and odd-cycle constraints. We characterise nearbipartite t-perfect and P5-free t-perfect graphs in terms of forbidden tminors. Moreover, we show that P5-free t-perfect graphs can always be coloured with three colours, and that they can be recognised in polynomial time.
متن کاملStrong T-Perfection of Bad-K4-Free Graphs
Abstract. We show that each graph not containing a bad subdivision of K4 as a subgraph, is strongly t-perfect. Here a graph G = (V, E) is strongly t-perfect if for each weight function w : V → Z+, the maximum weight of a stable set is equal to the minimum (total) cost of a family of vertices, edges, and circuits covering any vertex v at least w(v) times. By definition, the cost of a vertex or e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2017
ISSN: 0895-4801,1095-7146
DOI: 10.1137/16m1059874